eg-GRIDS: Context-Free Grammatical Inference from Positive Examples Using Genetic Search
نویسندگان
چکیده
In this paper we present eg-GRIDS, an algorithm for inducing context-free grammars that is able to learn from positive sample sentences. The presented algorithm, similar to its GRIDS predecessors, uses simplicity as a criterion for directing inference, and a set of operators for exploring the search space. In addition to the basic beam search strategy of GRIDS, eg-GRIDS incorporates an evolutionary grammar selection process, aiming to explore a larger part of the search space. Evaluation results are presented on artificially generated data, comparing the performance of beam search and genetic search. These results show that genetic search performs better than beam search while being significantly more efficient computationally.
منابع مشابه
Information Extraction using Context-free Grammatical Inference from Positive Examples
Information extraction from textual data has various applications, such as semantic search. Learning from positive example have theoretical limitations, for many useful applications (including natural languages), substantial part of practical structure (CFG) can be captured by framework introduced in this paper. Our approach to automate identification of structural information is based on gramm...
متن کاملMaintaining regularity and generalization in data using the minimum description length principle and genetic algorithm: Case of grammatical inference
In this paper, a genetic algorithm with minimum description length (GAWMDL) is proposed for grammatical inference. The primary challenge of identifying a language of infinite cardinality from a finite set of examples should know when to generalize and specialize the training data. The minimum description length principle that has been incorporated addresses this issue is discussed in this paper...
متن کاملe-GRIDS: Computationally Efficient Gramatical Inference from Positive Examples
In this paper we present a new computationally efficient algorithm for inducing context-free grammars that is able to learn from positive sample sentences. This new algorithm uses simplicity as a criterion for directing inference, and the search process of the new algorithm has been optimised by utilising the results of a theoretical analysis regarding the behaviour and complexity of the search...
متن کاملEvolutionary Grammatical Inference
INTRODUCTION Grammatical Inference (also known as grammar induction) is the problem of learning a grammar for a language from a set of examples. In a broad sense, some data is presented to the learner that should return a grammar capable of explaining to some extent the input data. The grammar inferred from data can then be used to classify unseen data or provide some suitable model for it. The...
متن کاملBreeding Grammars: Grammatical Inference with a Genetic Algorithm
This paper presents a genetic algorithm used to infer context-free grammars from legal and illegal examples of a language. It discusses the representation of grammar rules in the form of bitstringsby way of an interval coding scheme, genetic operators for reproduction of grammars, and the method of evaluating the fitness of grammars with respect to the training examples. Results are reported on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004